Novelty Search in Competitive Coevolution

نویسندگان

  • Jorge C. Gomes
  • Pedro Mariano
  • Anders Lyhne Christensen
چکیده

One of the main motivations for the use of competitive coevolution systems is their ability to capitalise on arms races between competing species to evolve increasingly sophisticated solutions. Such arms races can, however, be hard to sustain, and it has been shown that the competing species often converge prematurely to certain classes of behaviours. In this paper, we investigate if and how novelty search, an evolutionary technique driven by behavioural novelty, can overcome convergence in coevolution. We propose three methods for applying novelty search to coevolutionary systems with two species: (i) score both populations according to behavioural novelty; (ii) score one population according to novelty, and the other according to fitness; and (iii) score both populations with a combination of novelty and fitness. We evaluate the methods in a predator-prey pursuit task. Our results show that novelty-based approaches can evolve a significantly more diverse set of solutions, when compared to traditional fitness-based coevolution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novelty-Driven Cooperative Coevolution

Cooperative coevolutionary algorithms (CCEAs) rely on multiple coevolving populations for the evolution of solutions composed of coadapted components. CCEAs enable, for instance, the evolution of cooperative multiagent systems composed of heterogeneous agents, where each agent is modelled as a component of the solution. Previous works have, however, shown that CCEAs are biased toward stability:...

متن کامل

Avoiding convergence in cooperative coevolution with novelty search

Cooperative coevolution is an approach for evolving solutions composed of coadapted components. Previous research has shown, however, that cooperative coevolutionary algorithms are biased towards stability: they tend to converge prematurely to equilibrium states, instead of converging to optimal or near-optimal solutions. In single-population evolutionary algorithms, novelty search has been sho...

متن کامل

Evolution of heterogeneous multirobot systems through behavioural diversity

Heterogeneity is present in many collective systems found in nature and considered fundamental for effective task execution in several complex, real-world scenarios. Evolutionary computation has the potential to automate the design of multirobot systems, but to date, it has mostly been applied to the design of homogeneous systems. We have recently demonstrated that novelty search can overcome d...

متن کامل

A Competitive Markov Approach to the Optimal Combat Strategies of On-Line Action Role-Playing Game Using Evolutionary Algorithms

In the case of on-line action role-playing game, the combat strategies can be divided into three distinct classes, Strategy of Motion(SM), Strategy of Attacking Occasion (SAO) and Strategy of Using Skill (SUS). In this paper, we analyze such strategies of a basic game model in which the combat is modeled by the discrete competitive Markov decision process. By introducing the chase model and the...

متن کامل

Literature Review

2 Coevolution 4 2.1 Competitive Coevolution . . . . . . . . . . . . . . . . . . . . . . . 4 2.1.1 Just Two Individuals . . . . . . . . . . . . . . . . . . . . . 4 2.1.2 One Population . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1.3 More than One Population . . . . . . . . . . . . . . . . . 5 2.1.4 Competitive Fitness Algorithms . . . . . . . . . . . . . . 6 2.1.5 Analysis . . . . . . . ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014